Lexicographical Manipulations for Correctly Computing Regular Tetrahedralizations with Incremental Topological Ipping

نویسنده

  • Javier Bernal
چکیده

Edelsbrunner and Shah have proven that incremental topological ipping works for constructing a regular triangulation for a nite set of weighted points in d?dimensional space. This paper describes the lexicographical manipulations employed in a recently completed implementation of their method for correctly computing 3-dimensional regular triangulations. At the start of the execution of this implementation a regular triangulation for the vertices of an artiicial cube that contains the points is constructed. Throughout the execution the vertices of this cube are treated in the proper lexicographical manner so that the nal triangulation is correct.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES

We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...

متن کامل

A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS

Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.

متن کامل

Use of Structure Codes (Counts) for Computing Topological Indices of Carbon Nanotubes: Sadhana (Sd) Index of Phenylenes and its Hexagonal Squeezes

Structural codes vis-a-vis structural counts, like polynomials of a molecular graph, are important in computing graph-theoretical descriptors which are commonly known as topological indices. These indices are most important for characterizing carbon nanotubes (CNTs). In this paper we have computed Sadhana index (Sd) for phenylenes and their hexagonal squeezes using structural codes (counts). Sa...

متن کامل

The Edge--ipping Distance of Triangulations Institut F Ur Informatik | Report 76 *

An edge-ipping operation in a triangulation T of a set of points in the plane is a local restructuring that changes T into a triangulation that diiers from T in exactly one edge. The edge-ipping distance between two triangulations of the same set of points is the minimum number of edge-ipping operations needed to convert one into the other. In the context of computing the rotation distance of b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007